Di-Forcing Polynomials for Cyclic Ladder Graphs CLn

Anti-forcing number of some specific graphs

Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...

Fuzzy Forcing Set on Fuzzy Graphs

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

Ladder Operators for q-orthogonal Polynomials

The q− difference analog of the classical ladder operators is derived for those orthogonal polynomials arising from a class of indeterminate moments problem.

Tutte Polynomials of Flower Graphs

On the zero forcing number of some Cayley graphs

‎Let Γa be a graph whose each vertex is colored either white or black‎. ‎If u is a black vertex of Γ such that exactly one neighbor‎ ‎v of u is white‎, ‎then u changes the color of v to black‎. ‎A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that‎ if initially the vertices in Z are colored black and the remaining vertices are colored white‎, ‎then Z changes the col...